Rate of Convergence in Recursive Parameter Estimation Procedures
نویسندگان
چکیده
منابع مشابه
Rate of Convergence in Recursive Parameter Estimation Procedures
This paper is concerned with the rate of convergence of recursive estimation procedures for parameters of discrete time stochastic processes. Applications to estimation of parameters in several models are presented to illustrate the theory. 2000 Mathematics Subject Classification: 62L12, 62L20, 62F10, 62F12, 62F35, 62M99.
متن کاملRecursive Parameter Estimation: Asymptotic expansion
This paper is concerned with the asymptotic behaviour of estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The results of the paper can be used to determine the form of the recursive procedure which is expected to have the same asymptotic properties as the corresponding nonrecursive one defined as a so...
متن کاملAn Analysis of Parameter Evaluation of Recursive Procedures
A class of recursive program schemata PR is defined abstracting ALGOL-like procedures. Four generic types of parameter evaluation are considered; call by value, PRV, call by copy, PRc, call by reference, PRr, and call by name, PRj. Two other types of theoretical interest are also considered: "normal evaluation", Ffin, a non-side effect, evaluation postponement mechansim and call by ouote, PRq, ...
متن کاملRecursive parameter estimation for categorical process control
Statistical process adjustment (SPA) is utilised prevalently in novel manufacturing scenarios. When quality characteristics rather than internal process variables are inspected for the purpose of quality control, data with different resolutions may be collected. This paper proposes a Bayesian framework for parameter estimation when only categorical observations are available. The proposed metho...
متن کاملAutomatic Verification of Recursive Procedures with One Integer Parameter
Context-free processes (BPA) have been used for dataflow-analysis in recursive procedures with applications in optimizing compilers [6]. We introduce a more refined model called BPA(ZZ) that can model not only recursive dependencies, but also the passing of integer parameters to subroutines. Moreover, these parameters can be tested against conditions expressible in Presburger-arithmetic. This n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: gmj
سال: 2007
ISSN: 1572-9176,1072-947X
DOI: 10.1515/gmj.2007.721